Hamiltonian path - PDFSEARCH.IO - Document Search Engine

Hamiltonian path
Results: 145

#	Item
31	Sage Reference Manual: Graph Theory Release 6.7 The Sage Development Team June 24, 2015 Add to Reading List Source URL: doc.sagemath.org Language: English - Date: 2015-06-24 05:21:38 Graph Neighbourhood Adjacency matrix Line graph Directed acyclic graph Hamiltonian path Eulerian path Tree Independent set Graph theory Mathematics NP-complete problems
32	Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar Add to Reading List Source URL: www.statistics.du.se Language: English - Date: 2014-04-22 07:57:30 NP-complete problems Travelling salesman problem Induced path Shortest path problem Graph Routing Combinatorial optimization Path Hamiltonian path Graph theory Theoretical computer science Mathematics
33	Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal\|gsat\|neeldhara}@csa.iisc.ernet.in Add to Reading List Source URL: drona.csa.iisc.ernet.in Language: English - Date: 2014-08-01 08:33:48 NP-complete problems Vertex cover Vertex Graph Hamiltonian path Tree Clique Neighbourhood Connectivity Graph theory Mathematics Theoretical computer science
34	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
35	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:18 Network flow Hamiltonian path Maximum flow problem Ford–Fulkerson algorithm Flow network Tree decomposition Minimum spanning tree Graph theory Mathematics Theoretical computer science
36	Herschel enneahedron net by Christian Perfect This is the smallest non-Hamiltonian polyhedron – you can’t draw a path starting and ending at the same vertex which visits each vertex exactly once. It’s also the only Add to Reading List Source URL: aperiodical.com - Date: 2014-09-19 08:40:38
37	On Universal Cycles of Labeled Graphs Greg Brockman Bill Kay Harvard University Add to Reading List Source URL: www.gregbrockman.com Language: English - Date: 2015-05-09 15:47:45 Degree Tree Directed graph Hamiltonian path Hypergraph Line graph Graph operations Graph theory Mathematics Graph
38	Name: ID: ICS 163 — Graph Algorithms — Winter 1994 — Final Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2006-04-27 18:46:37 Planar graphs Eulerian path Clique Tree Connectivity Graph Edge coloring Hamiltonian path Graph theory Graph coloring NP-complete problems
39	Distributed Computing FS 2013 Prof. R. Wattenhofer Michael K¨onig Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Mathematics NP-complete problems Hamiltonian path Connectivity Distributed hash table Graph theory Theoretical computer science Distributed data storage
40	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:12 Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory Mathematics Theoretical computer science

UPDATE